Frameworks for logically classifying polynomial-time optimisation problems.

We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimisation problems, cannot hope to do so, under the assumption that P ≠ NP. We do this by exhibiting polynomially-bounded maximisation and minimisation problems that can be expressed in the framework but whose decision versions are NP-complete. We propose an alternative logical framework, based around inflationary fixed-point logic, and show that we can capture the above classes of optimisation problems. We use the inductive depth of an inflationary fixed-point as a means to describe the objective functions of the instances of our optimisation problems

A Logic for Non-Deterministic Parallel Abstract State Machines

We develop a logic which enables reasoning about single steps of non-deterministic parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and St\"ark for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling of non-determinism (both bounded and unbounded) within the logical formalism. Moreover, we do this without sacrificing the completeness of the logic for statements about single steps of non-deterministic parallel ASMs, such as invariants of rules, consistency conditions for rules, or step-by-step equivalence of rules.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0748

Epistemic Logic with Partial Dependency Operator

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses decent expressivity and beautiful properties. Several interesting examples are provided, which highlight this logic's practical usage. The logic's bisimulation is then discussed, and we give a sound and strongly complete axiomatization for a sub-language of the logic

On the Complexity of Model Expansion

Abstract. We study the complexity of model expansion (MX), which is the prob-lem of expanding a given finite structure with additional relations to produce a finite model of a given formula. This is the logical task underlying many prac-tical constraint languages and systems for representing and solving search prob-lems, and our work is motivated by the need to provide theoretical foundations for these. We present results on both data and combined complexity of MX for several fragments and extensions of FO that are relevant for this purpose, in par-ticular the guarded fragment GFk of FO and extensions of FO and GFk with inductive definitions. We present these in the context of the two closely related, but more studied, problems of model checking and finite satisfiability. To obtain results on FO(ID), the extension of FO with inductive definitions, we provide translations between FO(ID) with FO(LFP), which are of independent interest.

THE EFFECT OF INSPIRED OXYGEN CONCENTRATION ON INTRAPULMONARY RIGHT-TO-LEFT SHUNT DURING POSTOPERATIVE MECHANICAL VENTILATION

A consecutive series of patients undergoing cardiac surgery for valve replacement was divided into two groups. The first underwent postoperative artificial ventilation using the oxygen-driven Bird ventilator. The inspiratory oxygen concentration was 83%. In the second group a Bird ventilator was also used but with an oxygen concentration of 40%. In the first group the intrapulmonary right-to-left shunt rose to an average of 17% during the first two postoperative daysand in the second group to an average of 9%. The study supports the view that the inspiratory oxygen concentration should only be kept high enough to achieve a normal oxygen saturation of arterial bloo

Decal: indirect transfer printing technique and its advanced applications in contemporary ceramic art

Transfer baskı, farklı yüzeylere uygulanabilmesi nedeniyle sanatsal ifadelerde yaratıcı fikirler üretilmesine olanak sağlayan, oldukça heyecan verici bir yöntemdir. Bu yöntem çeşitti uygulama teknikleriyle seramik alanında da yaygın olarak kullanılmaktadır. Seramikte uygulanan transfer baskı tekniklerinden biri de, 'indirekt transfer tekniği' olarak anılan 'çıkartma' /a da bir diğer adıyla 'dekal'dır. Seramik endüstrisinin yanı sıra çağdaş seramik sanatında da kullanılan çıkartma, bir dekor tekniği olarak, düz olmayan yüzeye uygulanabilir olması nedeniyle tercih edilmektedir. Çıkartma, sağlık koşulları açısından zararsız su bazlı malzemelerin geliştirilmesi ve bilgisayar destekli dijital uygulamaların bu alana uyarlanması ile günümüzde çok farklı şekillerde kullanılmaktadır. Bu makalede, çıkartma tekniğinin tarih içinde gelişimi, günümüz seramik sanatçılarının bu alanda yaptıkları araştırmalar ve günümüzde geliştirdikleri yeni tekniklere yer verdikleri çalışmalarının uygulama aşamaları incelenmekte ve aralarındaki uygulama farklılıkları açıklanmaktadır. Tranfer printing, which enables artists to produce creative ideas, is quite exciting method as it can be applied on various surfaces. With diverse range of its application techniques, this method is widely used in the field of ceramics. One of the tranfer printing techniques that is applied on ceramics is the water slide transfer which is called "indirect transfer technique", or in other words "decal". The water slide transfer technique, which is used in ceramic industry and in contemporary ceramic art as welt, is preferred because it is applicable on uneven surfaces. Today, water slide transfer technique is applied in a variety of different ways by means of wholesome and advanced water-based materials, and with the help of adapting digital sources to this field. This paper examines the development of water slide transfer technique throughout its history; the advanced techniques and researches conducted by contemporary ceramic artists and intends to explain the phases of their diverse practices.&nbsp

Formation of molecular oxygen in ultracold O + OH reaction

We discuss the formation of molecular oxygen in ultracold collisions between hydroxyl radicals and atomic oxygen. A time-independent quantum formalism based on hyperspherical coordinates is employed for the calculations. Elastic, inelastic and reactive cross sections as well as the vibrational and rotational populations of the product O2 molecules are reported. A J-shifting approximation is used to compute the rate coefficients. At temperatures T = 10 - 100 mK for which the OH molecules have been cooled and trapped experimentally, the elastic and reactive rate coefficients are of comparable magnitude, while at colder temperatures, T < 1 mK, the formation of molecular oxygen becomes the dominant pathway. The validity of a classical capture model to describe cold collisions of OH and O is also discussed. While very good agreement is found between classical and quantum results at T=0.3 K, at higher temperatures, the quantum calculations predict a larger rate coefficient than the classical model, in agreement with experimental data for the O + OH reaction. The zero-temperature limiting value of the rate coefficient is predicted to be about 6.10^{-12} cm^3 molecule^{-1} s^{-1}, a value comparable to that of barrierless alkali-metal atom - dimer systems and about a factor of five larger than that of the tunneling dominated F + H2 reaction.Comment: 9 pages, 8 figure

Unary Pushdown Automata and Straight-Line Programs

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed membership problems are P-complete, and inclusion is coNP-complete. Our upper bounds are based on a translation theorem between udpda and straight-line programs over the binary alphabet (SLPs). We show that the characteristic sequence of any udpda can be represented as a pair of SLPs---one for the prefix, one for the lasso---that have size linear in the size of the udpda and can be computed in polynomial time. Hence, decision problems on udpda are reduced to decision problems on SLPs. Conversely, any SLP can be converted in logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show coNP-hardness of the ordered matching problem for SLPs, from which we derive coNP-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showing that the universality problem is $\Pi_2 \mathrm P$-hard, using a new class of integer expressions. Our techniques have applications beyond udpda. We show that our results imply $\Pi_2 \mathrm P$-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards

A Polynomial Translation from the Two-Variable Guarded Fragment with Number Restrictions to the Guarded Fragment

We consider a two-variable guarded fragment with number restrictions for binary relations and give a satisfiability preserving transformation of formulas in this fragment to the three-variable guarded fragment. The translation can be computed in polynomial time and produces a formula that is linear in the size of the initial formula even for the binary coding of number restrictions. This allows one to reduce reasoning problems for many description logics to the satisfiability problem for the guarded fragment

К вопросу об оценке противокоррозионной эффективности ингибиторов атмосферной коррозии

Розробка, дослідження захисних антикорозійних властивостей і визначення механізму дії інгібіторів атмосферної корозії, призначених для захисту металу з тонкими шарами іржі, потребує проведення натурних та прискорених корозійних випробувань. Оскільки у більшості випадків цей процес довготривалий, то для швидкого визначення антикорозійної ефективності інгібіторів корозії розроблена методика їх прискорених випробувань. Методика полягає у визначенні захисних властивостей інгібітору шляхом зняття поляризаційних кривих у нейтральному середовищі на металі з продуктами атмосферної корозії та захисною плівкою.Development, research of protective anticorrosive properties and determination of mechanism of action of atmospheric corrosion inhibitors for the protection of metal with thin layers of rust demands carrying out of the natural and accelerated corrosion tests. As in most cases this process long, for rapid determination of anticorrosive efficiency of corrosion inhibitors the new method of their accelerated tests is developed. A method consists in definition of protective ability by removal of polarization curves on a metal with the products of atmospheric corrosion and protective film in a neutral environment